MXL3: An Efficient Algorithm for Computing Gröbner Bases of Zero-Dimensional Ideals
نویسندگان
چکیده
This paper introduces a new efficient algorithm, called MXL3, for computing Gröbner bases of zero-dimensional ideals. The MXL3 is based on XL algorithm, mutant strategy, and a new sufficient condition for a set of polynomials to be a Gröbner basis. We present experimental results comparing the behavior of MXL3 to F4 on HFE and random generated instances of the MQ problem. In both cases the first implementation of the MXL3 algorithm succeeds faster and uses less memory than Magma’s implementation of F4.
منابع مشابه
Comprehensive Border Bases for Zero Dimensional Parametric Polynomial Ideals
In this paper, we extend the idea of comprehensive Gröbner bases given by Weispfenning (1992) to border bases for zero dimensional parametric polynomial ideals. For this, we introduce a notion of comprehensive border bases and border system, and prove their existence even in the cases where they do not correspond to any term order. We further present algorithms to compute comprehensive border b...
متن کاملComputing Gröbner Bases by FGLM Techniques in a Non-commutative Setting
It is well known that the complexity of Gröbner bases computation strongly depends on the term ordering, moreover, elimination orderings often yield a greater complexity. This remark led to the so-called FGLM conversion problem, i.e. given a Gröbner basis w.r.t. a certain term ordering,‖ find a Gröbner basis of the same ideal w.r.t. another term ordering. One of the efficient approaches for sol...
متن کاملOn Border Basis and Gröbner Basis Schemes
Hilbert schemes of zero-dimensional ideals in a polynomial ring can be covered with suitable affine open subschemes whose construction is achieved using border bases. Moreover, border bases have proved to be an excellent tool for describing zero-dimensional ideals when the coefficients are inexact. And in this situation they show a clear advantage with respect to Gröbner bases which, neverthele...
متن کاملNumerical Computation of Gröbner Bases for Zero-dimensional Polynomial Ideals
It is well known that in the computation of Gröbner bases an arbitrarily small perturbation in the coefficients of polynomials may lead to a completely different staircase even if the roots of the polynomials change continuously. This phenomenon is called pseudo singularity in this paper. We show how such phenomenon may be detected and even “repaired” by adding a new variable and a binomial rel...
متن کاملTowards Algebraic Cryptanalysis of HFE Challenge 2
In this paper, we present an experimental analysis of HFE Challenge 2 (144 bit) type systems. We generate scaled versions of the full challenge fixing and guessing some unknowns. We use the MXL3 algorithm, an efficient algorithm for computing Gröbner basis, to solve these scaled versions. We review the MXL3 strategy and introduce our experimental results.
متن کامل